A TMS DSP processor based case study of Grigoryan FFT performance over Cooley-Tukey FFT (TMS320C6748, TMS320C5515)
نویسندگان
چکیده
منابع مشابه
Paired Faster Fft: Grigoryan Fft Implementation and Performance on Xilinx Fpgas and Tms Dsps
DOI: 10.5281/zenodo.55536 ABSTRACT Discrete Fourier Transform is a principal mathematical method for the frequency analysis and has wide applications in Engineering and Sciences. Because the DFT is so ubiquitous, fast methods for computing DFT have been studied extensively, and continuous to be an active research. The way of splitting the DFT gives out various fast algorithms. In this paper, we...
متن کاملImplementation Of Grigoryan FFT For Its Performance Case Study Over Cooley-Tukey FFT Using Xilinx Virtex-II Pro, Virtex-5 And Virtex-4 FPGAs
A large family of signal processing techniques consist of Fourier-transforming a signal, manipulating the Fourier-transformed data in a simple way, and reversing the transformation. We widely use Fourier frequency analysis in equalization of audio recordings, X-ray crystallography, artefact removal in Neurological signal and image processing, Voice Activity Detection in Brain stem speech evoked...
متن کاملCooley - Tukey FFT on the Connection
We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make e ective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...
متن کاملThe Cooley–Tukey FFT and Group Theory
In 1965 J. Cooley and J. Tukey published an article detailing an efficient algorithm to compute the Discrete Fourier Transform, necessary for processing the newly available reams of digital time series produced by recently invented analog-to-digital converters. Since then, the Cooley– Tukey Fast Fourier Transform and its variants has been a staple of digital signal processing. Among the many ca...
متن کاملCooley - Tukey FFT on the Connection MachineS
We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make eeective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Engineering
سال: 2013
ISSN: 2278-8719,2250-3021
DOI: 10.9790/3021-03125560